#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,a[maxn];
deque<int> q;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    q.push_back(a[1]);
    for(int i=2;i<=n;i++){
        int x=q.front();
        if(a[i]>x) q.pop_front();
        q.push_back(a[i]);
    }
    int ans=q.size();
    cout<<ans<<endl;
    return 0;
}
